Elementary estimates for the Chebyshev function
نویسندگان
چکیده
منابع مشابه
Always Chebyshev Interpolation In Elementary Function Computations
A common practice for computing an elementary transcendental function nowadays has two phases: reductions of input arguments to fall into a tiny interval and polynomial approximations for the function within the interval. Typically the interval is made tiny enough so that one won’t have to go for polynomials of very high degrees for accurate approximations. Often approximating polynomials as su...
متن کاملAsymptotic estimates of elementary probability distributions
Several new asymptotic estimates (with precise error bounds) are derived for Poisson and binomial distributions as the parameters tend to infinity. The analytic methods used are also applicable to other discrete distribution functions. AMS 1991 Mathematical Subject Classification: 60A99 33B20.
متن کاملOn Sharp Elementary Prime Number Estimates
but nearly a half a century passed before Hadamard and de la Vallée Poussin independently succeeded in proving that 7r (x) / {x/log x} -* I as x -> oc. This is the famous prime number theorem (P.N.T .) . Interesting accounts of the foregoing may be found in the books of Ingham [2], Landau [3], and Mathews [4] . Here we consider the following hypothetical question . Could Chebyshev in principle ...
متن کاملElementary Estimates for a Certain Type of Soto-andrade Sum
This paper shows that a certain type of Soto-Andrade sum can be estimated in an elementary way which does not use the Riemann hypothesis for curves over finite fields and which slightly sharpens previous estimates for this type of Soto-Andrade sum. As an application, we discuss how this implies that certain graphs arising from finite upper half planes in odd characteristic are Ramanujan without...
متن کاملElementary $L^\infty$ error estimates for super-resolution de-noising
This paper studies the problem of recovering a discrete complex measure on the torus from a finite number of corrupted Fourier samples. We assume the support of the unknown discrete measure satisfies a minimum separation condition and we use convex regularization methods to recover approximations of the original measure. We focus on two well-known convex regularization methods, and for both, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1989
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-52-4-307-337